-
1 connected polyhedron
Большой англо-русский и русско-английский словарь > connected polyhedron
-
2 connected polyhedron
Математика: связный многогранник -
3 connected polyhedron
мат.English-Russian scientific dictionary > connected polyhedron
-
4 regularly connected polyhedron
Математика: регулярно связный полиэдрУниверсальный англо-русский словарь > regularly connected polyhedron
-
5 simply connected polyhedron
Математика: односвязный многогранник (эйлеров)Универсальный англо-русский словарь > simply connected polyhedron
-
6 regularly connected polyhedron
English-Russian scientific dictionary > regularly connected polyhedron
-
7 simply connected polyhedron
односвязный [эйлеров] многогранникEnglish-Russian scientific dictionary > simply connected polyhedron
-
8 polyhedron
многогранник, полиэдр, полиэдроид, политоп- locally contractible polyhedron - simply connected polyhedron -
9 regularly
ровно regularly arranged matrix ≈ регулярно упорядоченная матрица regularly closed set ≈ регулярно замкнутое множество regularly closed subspace ≈ регулярно замкнутое подпространство regularly cocompact space ≈ регулярно кокомпактное пространство regularly connected complex ≈ регулярно связный комплекс regularly connected polyhedron ≈ регулярно связный полиэдр regularly convergent sequence ≈ регулярно сходящаяся последовательность regularly convergent series ≈ регулярно сходящийся ряд regularly convex set ≈ регулярно выпуклое множество regularly exhaustible surface ≈ регулярно исчерпываемая поверхность regularly finer partition ≈ регулярно более мелкое разбиение regularly missed observations ≈ регулярно пропускаемые наблюдения regularly ordered space ≈ регулярно упорядоченное пространство regularly partitioned matrix ≈ регулярно разделенная (на блоки) матрица regularly situated sets ≈ регулярно расположенные множества regularly situated subsets ≈ регулярно расположенные подмножества regularly varying function ≈ регулярно изменяющаяся функция - regularly closed - regularly convergent - regularly convex - regularly convexenvelope - regularly embedded - regularly homotopic - regularly shaped - regularly spaced правильно, размеренно регулярно, через одинаковые промежутки симметрично (юридическое) в соответствии с требованием права regularly в соответствии с требованиями права ~ регулярноБольшой англо-русский и русско-английский словарь > regularly
-
10 связный многогранник
Большой англо-русский и русско-английский словарь > связный многогранник
-
11 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph
См. также в других словарях:
Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) … Wikipedia
Császár polyhedron — An animation of the Császár polyhedron being rotated and unfolded. Type Toroidal polyhedron Faces 14 triangles Edges 21 Verti … Wikipedia
Net (polyhedron) — Net of a dodecahedron When the Earth is mappe … Wikipedia
Dual polyhedron — The dual of a cube is an octahedron, shown here with vertices at the cube face centers … Wikipedia
K-vertex-connected graph — In graph theory, a graph G with vertex set V(G) is said to be k vertex connected (or k connected) if G setminus X is connected for all X subseteq V(G) with left| X ight| < k. In plain English, a graph is k connected if the graph remains connected … Wikipedia
Polyhedral skeletal electron pair theory — In chemistry the polyhedral skeletal electron pair theory provides electron counting rules useful for predicting the structures of clusters such as borane and carborane clusters. The electron counting rules were originally formulated by Kenneth… … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Prism (geometry) — For other uses, see Prism (disambiguation). Set of uniform prisms (A hexagonal prism is shown) Type uniform polyhedron Faces 2+n total: 2 {n} n {4} Edges … Wikipedia
Knot theory — A three dimensional depiction of a thickened trefoil knot, the simplest non trivial knot … Wikipedia
Octahedron — For the album by The Mars Volta, see Octahedron (album). Regular Octahedron (Click here for rotating model) Type Platonic solid Elements F = 8, E = 12 V = 6 (χ = 2) Faces by sides … Wikipedia
